Area-efficient algorithms for straight-line tree drawings
نویسندگان
چکیده
منابع مشابه
Area-eecient Algorithms for Upward Straight-line Tree Drawings ?
In this paper, we investigate planar upward straight-line grid drawing problems for bounded-degree rooted trees so that a drawing takes up as little area as possible. A planar upward straight-line grid tree drawing satisses the following four constraints: (1) all vertices are placed at distinct grid points (grid), (2) all edges are drawn as straight lines (straight-line), (3) no two edges in th...
متن کاملMinimizing the Area for Planar Straight-Line Grid Drawings
The problem of finding straight-line drawings for planar graphs with small area is an important aspect in the context of drawing planar graphs and it has been extensively studied. In this thesis we will study the problem of finding planar straight-line grid drawings with minimum area. Our contributions to this problem are as follows: First, we will show, that the problem of finding minimum area...
متن کاملOptimizing Area and Aspect Ratio in Straight-Line Orthogonal Tree Drawings
We investigate the problem of drawing an arbitrary n-node binary tree orthogonally in an integer grid using straight-line edges. We show that one can simultaneously achieve good area bounds while also allowing the aspect ratio to be chosen as being O(1) or sometimes even an arbitrary parameter. In addition, we show that one can also achieve an additional desirable aesthetic criterion, which we ...
متن کاملStraight - Line Drawings on Restricted
This paper investigates the following question: Given an integer grid , where is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit straight-line crossing-free drawings with vertices located at the grid points of ? We characterize the trees that can be drawn on a two dimensional c n k grid, where k and c are given integer constants, and on a two ...
متن کاملStraight-line Drawings of 1-planar Graphs
The classical Fáry’s theorem from the 1930s states that every planar graph can be drawn as a straight-line drawing. In this paper, we extend Fáry’s theorem to non-planar graphs. More specifically, we study the problem of drawing 1-planar graphs with straight-line edges. A 1-planar graph is a sparse non-planar graph with at most one crossing per edge. We give a characterisation of those 1planar ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2000
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(99)00053-x